A zero-one law for RP and derandomization of AM if NP is not smallIMPAGLIAZZO, Russell; MOSER, Philippe.Information and computation (Print). 2009, Vol 207, Num 7, pp 787-792, issn 0890-5401, 6 p.Article

Derandomization of PPSZ for unique-k-SATROLF, Daniel.Lecture notes in computer science. 2005, pp 216-225, issn 0302-9743, isbn 3-540-26276-8, 10 p.Conference Paper

A simpler and better derandomization of an approximation algorithm for single source rent-or-buyWILLIAMSON, David P; VAN ZUYLEN, Anke.Operations research letters. 2007, Vol 35, Num 6, pp 707-712, issn 0167-6377, 6 p.Article

A zero-one SUBEXP-dimension law for BPPMOSER, Philippe.Information processing letters. 2011, Vol 111, Num 9, pp 429-432, issn 0020-0190, 4 p.Article

Derandomizing homomorhism testing in general groupsSHPILKA, Amir; WIGDERSON, Avi.SIAM journal on computing (Print). 2007, Vol 36, Num 4, pp 1215-1230, issn 0097-5397, 16 p.Article

Efficient steganography with provable security guaranteesKIAYIAS, Aggelos; RAEKOW, Yona; RUSSELL, Alexander et al.Lecture notes in computer science. 2005, pp 118-130, issn 0302-9743, isbn 3-540-29039-7, 1Vol, 13 p.Conference Paper

Relations between average-case and worst-case complexityPAVAN, A; VINODCHANDRAN, N. V.Lecture notes in computer science. 2005, pp 422-432, issn 0302-9743, isbn 3-540-28193-2, 11 p.Conference Paper

Solvable group isomorphism is (almost) in NP ∩ coNPARVIND, V; TORAN, Jacobo.IEEE Conference on Computational Complexity. 2004, pp 91-103, isbn 0-7695-2120-7, 1Vol, 13 p.Conference Paper

Deterministic Discrepancy MinimizationBANSAL, Nikhil; SPENCER, Joel.Algorithmica. 2013, Vol 67, Num 4, pp 451-471, issn 0178-4617, 21 p.Conference Paper

Proppian random walks in ZFREIRE, Juliana; SPENCER, Joel.Discrete mathematics. 2011, Vol 311, Num 5, pp 349-361, issn 0012-365X, 13 p.Article

Deterministically testing sparse polynomial identities of unbounded degreeBLASER, Markus; HARDT, Moritz; LIPTON, Richard J et al.Information processing letters. 2009, Vol 109, Num 3, pp 187-192, issn 0020-0190, 6 p.Article

A linear time deterministic algorithm to find a small subset that approximates the centroidWORAH, Pratik; SEN, Sandeep.Information processing letters. 2007, Vol 105, Num 1, pp 17-19, issn 0020-0190, 3 p.Article

Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gatesVIOLA, Emanuele.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1387-1403, issn 0097-5397, 17 p.Article

Deterministic hypergraph coloring and its applicationsLU, Chi-Jen.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 2, pp 320-331, issn 0895-4801, 12 p.Article

Deterministic constructions of approximate distance oracles and spannersRODITTY, Liam; THORUP, Mikkel; ZWICK, Uri et al.Lecture notes in computer science. 2005, pp 261-272, issn 0302-9743, isbn 3-540-27580-0, 12 p.Conference Paper

Derandomization of dimensionality reduction and SDP based algorithmsBHARGAVA, Ankur; KOSARAJU, S. Rao.Lecture notes in computer science. 2005, pp 396-408, issn 0302-9743, isbn 3-540-28101-0, 13 p.Conference Paper

A Fast Output-Sensitive Algorithm for Boolean Matrix MultiplicationLINGAS, Andrzej.Algorithmica. 2011, Vol 61, Num 1, pp 36-50, issn 0178-4617, 15 p.Article

QUASIRANDOM RUMOR SPREADING ON THE COMPLETE GRAPH IS AS FAST AS RANDOMIZED RUMOR SPREADINGFOUNTOULAKIS, Nikolaos; HUBER, Anna.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 1964-1991, issn 0895-4801, 28 p.Article

Improved approximation algorithms for metric MaxTSPCHEN, Zhi-Zhong; NAGOYA, Takayuki.Journal of combinatorial optimization. 2007, Vol 13, Num 4, pp 321-336, issn 1382-6905, 16 p.Article

Dimension characterizations of complexity classesXIAOYANG GU; LUTZ, Jack H.Lecture notes in computer science. 2006, pp 471-479, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 9 p.Conference Paper

Derandomization of Schuler's algorithm for SATDANTSIN, Evgeny; WOLPERT, Alexander.Lecture notes in computer science. 2005, pp 80-88, issn 0302-9743, isbn 3-540-27829-X, 9 p.Conference Paper

AN IMPROVED DERANDOMIZED APPROXIMATION ALGORITHM FOR THE MAX-CONTROLLED SET PROBLEMMARTINHON, Carlos; PROTTI, Fábio.Informatique théorique et applications (Imprimé). 2011, Vol 45, Num 2, pp 181-196, issn 0988-3754, 16 p.Article

On the derandomization of the graph test for homomorphism over groupsLINQING TANG.Theoretical computer science. 2011, Vol 412, Num 18, pp 1718-1728, issn 0304-3975, 11 p.Conference Paper

CIRCUIT LOWER BOUNDS FOR MERLIN-ARTHUR CLASSES : Theory of ComputingSANTHANAM, Rahul.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 1038-1061, issn 0097-5397, 24 p.Article

Reconstructive Dispersers and Hitting Set GeneratorsUMANS, Christopher.Algorithmica. 2009, Vol 55, Num 1, pp 134-156, issn 0178-4617, 23 p.Conference Paper